roaring_analysis | Roaring bitmaps are a hybrid data structure

roaring_analysis is a Jupyter Notebook library. roaring_analysis has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can download it from GitHub.

Roaring bitmaps are a hybrid data structure to represent sets of unsigned 32 bits integers. Their main purpose is to be more efficient, both in memory and in computation time, than classical set implementations like hash sets. They are also more versatile than bitsets, which should not be used when the elements are “too sparse”. A roaring bitmap is made of a sorted array of “containers”. An element of a roaring bitmap will be represented in one of these containers, depending on its 16 higher order bits. The container will therefore hold the 16 lower order bits of the integer (thus, containers can be viewed as sets of unsigned 16 bits integers). The following figure gives a quick overview.